Non-binary multithreshold decoders of symbolic self- orthogonal codes for q-ary symmetric channels
نویسندگان
چکیده
Symbolic q-ary multithreshold decoding (qMTD) of q-ary self-orthogonal codes is submitted. It’s shown the BER performance of qMTD is close to the results provided by optimum total search methods, which are not realizable for nonbinary codes in general. New decoders are compared with different decoders of Reed-Solomon codes. The performance provided by non-binary MTD in some cases is unattainable for arbitrary long Reed-Solomon codes with classical decoders. Concatenation of q-ary self-orthogonal code with non-binary single check on module q codes is described. The complexity of qMTD is discussed also.
منابع مشابه
The Performance of Concatenated Schemes Based on Non-binary Multithreshold Decoders
Symbolic q-ary multithreshold decoding (qMTD) for q-ary selforthogonal codes (qSOC) is analyzed. The SER performance of qMTD is shown to be close to the results provided by optimum total search methods, which are not realizable for non-binary codes in general. qMTD decoders are compared with different decoders for Reed-Solomon and LDPC codes. The results of concatenation of qSOC with simple to ...
متن کاملAnalysis of Error Floors for Non-binary LDPC Codes over General Linear Group through q-Ary Memoryless Symmetric Channels
In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over general linear groups with those for non-binary LDPC codes over finite fields transmitted through the q-ary memoryless symmetric channels under belief propagation decoding. To analyze non-binary LDPC codes defined over both the general linear group GL(m, F2) and the f...
متن کاملFinite-Dimensional Bounds on Zm and Binary LDPC Codes with Belief Propagation Decoders: Stability Conditions on Zm Codes and Cutoff Rate Analysis on Non-symmetric Binary Channels
This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Z m and binary LDPC codes, assuming belief propagation decoding on memoryless channels. Two noise measures will be considered: the Bhattacharyya noise parameter and the soft bit value for a MAP decoder on the uncoded channel. For Z m LDPC codes, an iterative m-dimensional bound is derived for m-ary-input/...
متن کاملFinite-Dimensional Bounds on Zm and Binary LDPC Codes with Belief Propagation Decoders
This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Zm and binary lowdensity parity-check (LDPC) codes, assuming belief propagation decoding on memoryless channels. A concrete framework is presented, admitting systematic searches for new bounds. Two noise measures are considered: the Bhattacharyya noise parameter and the soft bit value for a maximum a post...
متن کاملA Fresh Look at Coding for q-ary Symmetric Channels
This paper studies coding schemes for the q-ary symmetric channel based on binary low-density parity-check (LDPC) codes that work for any alphabet size q = 2, m ∈ N, thus complementing some recently proposed packet-based schemes requiring large q. First, theoretical optimality of a simple layered scheme is shown, then a practical coding scheme based on a simple modification of standard binary L...
متن کامل